/*
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */

/* $Id: queue.h 34 2007-07-13 03:17:53Z kf701.ye $ */

#ifndef _SOFT_FACTORY_QUEUE_H_
#define _SOFT_FACTORY_QUEUE_H_

#include <stdint.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

typedef struct _node_{
	void *data;
	struct _node_ *next;
	struct _node_ *prev;
} _node_t;

typedef struct{
	_node_t *head;
	_node_t *tail;
	uint32_t length;
} queue_t;

queue_t *data_queue_new(void);
void data_queue_free(queue_t *qu);

uint32_t data_queue_length(queue_t *qu);

void data_queue_push_head(queue_t *qu, void *data);
void data_queue_push_tail(queue_t *qu, void *data);
void data_queue_push_nth(queue_t *qu, void *data, uint32_t n);

void *data_queue_pop_head(queue_t *qu);
void *data_queue_pop_tail(queue_t *qu);
void *data_queue_pop_nth(queue_t *qu, uint32_t n);

void *data_queue_peek_head(queue_t *qu);
void *data_queue_peek_tail(queue_t *qu);
void *data_queue_peek_nth(queue_t *qu, uint32_t n);


#endif
